A Two-Phase Gradient Projection Algorithm for Solving the Combined Modal Split and Traffic Assignment Problem with Nested Logit Function

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

A Gradient Projection Algorithm for Side-constrained Traffic Assignment

A Path-Based Algorithm for the Cross-Nested Logit Stochastic User Equilibrium Traffic Assignment

This paper investigates the single-class static stochastic user equilibrium (SUE) problem with separable and additive link costs. A SUE assignment based on the Cross-Nested Logit (CNL) route choice model is presented. The CNL model can better represent route choice behavior compared to the Multinomial Logit (MNL) model, while keeping a closed form equation. The paper uses a specific optimizatio...

A greedy algorithm for the two-level nested logit model

We consider the assortment optimization problem under the classical two-level nested logit model. We establish a necessary and sufficient condition for the optimal assortment and develop a simple and fast greedy algorithm that iteratively removes at most one product from each nest to compute an optimal solution.

/ the Multi - Modal Traffic Assignment Problem

Traffic equilibrium analysis 4~s provided useful insight into the transportation planning proce~s. Even for deterministic demand models, though, the state-of-the-art does not include any efficient approach that is applicable for general equilibrium models. Existing convex programming approaches, which are efficient and guarantee convergence, are restrj.cted to single commodity (mode, user class...